On transversals in minimal imperfect graphs
نویسندگان
چکیده
V. Chv atal proved that no minimal imperfect graph has a small transversal, that is, a set of vertices of cardinality at most + ! 1 which meets every !-clique and every -stable set. In this paper we prove that a slight generalization of this notion of small transversal leads to a conjecture which is as strong as Berge's Strong Perfect Graph Conjecture for a very large class of graphs, although it seems to be weaker than Berge's conjecture for those graphs whose diameter does not exceed 6. 3
منابع مشابه
Enumerating minimal dominating sets in chordal bipartite graphs
We show that all minimal dominating sets of a chordal bipartite graph can be generated in incremental polynomial, hence output polynomial, time. Enumeration of minimal dominating sets in graphs is equivalent to enumeration of minimal transversals in hypergraphs. Whether the minimal transversals of a hypergraph can be enumerated in output polynomial time is a well-studied and challenging questio...
متن کاملNew Results on Minimal Strongly Imperfect Graphs
The characterization of strongly perfect graphs by a restricted list of forbidden induced subgraphs has remained an open question for a long time. The minimal strongly imperfect graphs which are simultaneous imperfect are only odd holes and odd antiholes ( E. Olaru, [9]), but the entire list is not known, in spite of a lot of particular results in this direction. In this paper we give some new ...
متن کاملOn classes of minimal circular-imperfect graphs
Circular-perfect graphs form a natural superclass of perfect graphs: on the one hand due to their definition by means of a more general coloring concept, on the other hand as an important class of χ-bound graphs with the smallest non-trivial χ-binding function χ(G) ≤ ω(G) + 1. The Strong Perfect Graph Conjecture, recently settled by Chudnovsky et al. [4], provides a characterization of perfect ...
متن کاملEnumeration of Minimal Dominating Sets and Variants
In this paper, we are interested in the enumeration of minimal dominating sets in graphs. A polynomial delay algorithm with polynomial space in split graphs is presented. We then introduce a notion of maximal extension (a set of edges added to the graph) that keeps invariant the set of minimal dominating sets, and show that graphs with extensions as split graphs are exactly the ones having chor...
متن کاملA New Algorithm for the Hypergraph Transversal Problem
We consider the problem of finding all minimal transversals of a hypergraph H ⊆ 2 , given by an explicit list of its hyperedges. We give a new decomposition technique for solving the problem with the following advantages: (i) Global parallelism: for certain classes of hypergraphs, e.g. hypergraphs of bounded edge size, and any given integer k, the algorithm outputs k minimal transversals of H i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 165-166 شماره
صفحات -
تاریخ انتشار 1997